Stochastic Local Community Detection in Networks

We propose a stochastic agglomerative algorithm to detect the local community of some given seed vertex/vertices in network. Instead giving deterministic binary output, our method assigns every vertex value that is probability this particular would be seed. The proposed procedure has several advantages over existing algorithms, including avoiding random tie-breaking, evaluating uncertainties, detecting hierarchical structure, etc. Synthetic and real data examples are included for illustration.